Infinite Hamilton Cycles in Squares of Locally Finite Graphs
نویسنده
چکیده
We prove Diestel’s conjecture that the square G of a 2-connected locally finite graph G has a Hamilton circle, a homeomorphic copy of the complex unit circle S in the Freudenthal compactification of G.
منابع مشابه
Extending Cycles Locally to Hamilton Cycles
A Hamilton circle in an infinite graph is a homeomorphic copy of the unit circle S1 that contains all vertices and all ends precisely once. We prove that every connected, locally connected, locally finite, claw-free graph has such a Hamilton circle, extending a result of Oberly and Sumner to infinite graphs. Furthermore, we show that such graphs are Hamilton-connected if and only if they are 3-...
متن کاملHamilton Cycles in Planar Locally Finite Graphs
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable concept of an infinite cycle. Such a concept was provided by Diestel and Kühn, who defined circles to be homeomorphic images of the unit circle in the Freudenthal compactification of the (locally finite) graph. With this...
متن کاملOn the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
The topological approach to the study of infinite graphs of Diestel and K ̈hn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4-edge-connected graph is hamiltonian. We prove a weaker version of this result for infinite graphs: The line graph of locally finite, 6-edge-connected graph w...
متن کاملHamiltonicity in Locally Finite Graphs: Two Extensions and a Counterexample
We state a sufficient condition for the square of a locally finite graph to contain a Hamilton circle, extending a result of Harary and Schwenk about finite graphs. We also give an alternative proof of an extension to locally finite graphs of the result of Chartrand and Harary that a finite graph not containing K4 or K2,3 as a minor is Hamiltonian if and only if it is 2-connected. We show furth...
متن کاملCycle-cocycle partitions and faithful cycle covers for locally finite graphs
By a result of Gallai, every finite graph G has a vertex partition into two parts each inducing an element of its cycle space. This fails for infinite graphs if, as usual, the cycle space is defined as the span of the edge sets of finite cycles in G. However we show that, for the adaptation of the cycle space to infinite graphs recently introduced by Diestel and Kühn (which involves infinite cy...
متن کامل